Short one-time signatures
نویسندگان
چکیده
منابع مشابه
Short one-time signatures
We present a new one-time signature scheme having short signatures. Our new scheme is also the first one-time signature scheme that supports aggregation, batch verification, and which admits efficient proofs of knowledge. It has a fast signing algorithm, requiring only modular additions, and its verification cost is comparable to ECDSA verification. These properties make our scheme suitable for...
متن کاملLecture 13 Many-time Signatures 1 One-time Signatures
Constructing a scheme that satisfies such a strong security notion is very involved, so we start with an easier goal: unforgeability under a one-time chosen-message attack (uf-1cma). The definition is syntactically identical to the one above, but F is restricted to make (at most) one query to its signing oracle. Here we describe Lamport’s one-time signature scheme OTS for messages of length ` =...
متن کاملEfficient one-time proxy signatures
Proxy signatures allow a signer to delegate signing ability to a proxy signer. Many schemes have been proposed for proxy signatures under typical security requirements. The authors propose a proxy signature model with extended security requirements. Based on Shamir’s online/ offline signature scheme, a proxy signature scheme is proposed for the model. In addition to the typical requirements, th...
متن کاملEfficient One-Time Proxy Signatures
One-time proxy signatures are one-time signatures for which a primary signer can delegate his or her signing capability to a proxy signer. In this work we propose two one-time proxy signature schemes with different security properties. Unlike other existing one-time proxy signatures that are constructed from public key cryptography, our proposed schemes are based one-way functions without trapd...
متن کاملOn Constructing Optimal One-Time Signatures
One-time signatures (OTS) offer a viable alternative to public keybased digital signatures. OTS security is based only on the strength of the underlying one-way function and does not depend on the conjectured difficulty of a mathematical problem. OTS methods have been proposed in the past but no solid foundation exists for judging their efficiency or optimality. This paper develops a new method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2011
ISSN: 1930-5346
DOI: 10.3934/amc.2011.5.473